Binary search

Write a python program for Binary Search.

Binary Search:

In computer science, a binary search or half-interval search

algorithm finds the position of a target value within a sorted array.

The binary search algorithm can be classified as a dichotomies

DIVIDE-AND-CONQUER search algorithm and executes in logarithmic time.

Test Data :

binary_search([1,2,3,5,8], 6) -> False

binary_search([1,2,3,5,8], 5) -> True

def binary_search(A, N):

       first = 0
       last = len(A)-1
       found = False

       while first <= last and not found:

               mid = (first + last)//2

               if A[mid] == N :
                       found = True
               else:
                       if N < A[mid]:
                               last = mid - 1
                       else:
                               first = mid + 1
       return found

print(binary_search([1, 2, 3, 5, 8], 6))                       # False
print(binary_search([1, 2, 3, 5, 8], 5))                       # True

See also

https://www.w3resource.com/python-exercises/data-structures-and-algorithms/python-search-and-sorting-exercise-1.php